Solving the \nearest Point on Object" Problem Using Recursive Subdivision Solving the \nearest Point on Object" Problem Using Recursive Subdivision

Finding the nearest point on a given 2D or 3D object computation is a problem that arises in many computer graphics applications, such as interactive modeling, rendering of implicit surfaces or collision detection. Unfortunately, for objects with complex geometry such as curves or surfaces, the computation cost becomes prohibitive as a minimization process acting in multiple dimensions has to be employed over the whole object. We propose a new approach, based on recursive subdivision of convex hulls, that is purely geometric and can be applied to a great variety of objects. Abstract : Finding the nearest point on a given 2D or 3D object computation is a problem that arises in many computer graphics applications, such as interactive modeling, rendering of implicit surfaces or collision detection. Unfortunately, for objects with complex geometry such as curves or surfaces, the computation cost becomes prohibitive as a minimization process acting in multiple dimensions has to be employed over the whole object. We propose a new approach, based on recursive subdivision of convex hulls, that is purely geometric and can be applied to a great variety of objects.